Maximum queue size and hashing with lazy deletion
نویسندگان
چکیده
منابع مشابه
Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
We study the dynamic data structure management technique called Hashing with Lazy Deletion (HwLD). A table managed under HwLD is built via a sequence of insertions and deletions of items. When hashing with lazy deletions, one does not delete items as soon as possible, but keeps more items in the data structure than immediate-deletion strategies would. This deferral allows the use of a simpler d...
متن کاملA Queueing Analysis of Hashing with Lazy Deletion
Hashing with lazy deletion is a simple method for maintaining a dynamic dictionary: items are inserted and sought as usual in a separate-chaining hash table; however, items that no longer need to be in the data structure remain until a later insertion operation stumbles on them and removes them from the table. Because hashing with lazy deletion does not delete items as soon as possible, it keep...
متن کاملMaximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust multiplechoice hashing scheme with high memory utilization that canbe used in many network device applications. Unfortunately, formemory loads beyond 0.5, little is known on its performance.In this paper, we analyze its average performance over suchloads. We tackle this problem by recasting the problem as ananalysis of the expected...
متن کاملSecond Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1991
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01759063